An Erdős-Ko-Rado theorem for cross t-intersecting families
نویسندگان
چکیده
Article history: Received 28 January 2013 Available online 27 September 2014
منابع مشابه
THE EIGENVALUE METHOD FOR CROSS t-INTERSECTING FAMILIES
We show that the Erdős–Ko–Rado inequality for t-intersecting families of subsets can be easily extended to an inequality for cross t-intersecting families by using the eigenvalue method. The same applies to the case of t-intersecting families of subspaces. The eigenvalue method is one of the proof techniques to get Erdős–Ko–Rado type inequalities for t-intersecting families, for example, a proo...
متن کاملTowards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.
متن کاملCross t-Intersecting Integer Sequences from Weighted Erdős-Ko-Rado
Let m,n and t be positive integers. Consider [m] as the set of sequences of length n on anm-letter alphabet. We say that two subsets A ⊂ [m] and B ⊂ [m] cross t-intersect if any two sequences a ∈ A and b ∈ B match in at least t positions. In this case it is shown that if m > (1− 1 t 2 ) −1 then |A||B| ≤ (mn−t)2. We derive this result from a weighted version of the Erdős–Ko–Rado theorem concerni...
متن کاملRegular bipartite graphs and intersecting families
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erdős–Ko–Rado theorem, the Hilton–Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and ...
متن کاملErdös-Ko-Rado from intersecting shadows
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős–Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 128 شماره
صفحات -
تاریخ انتشار 2014